Fast Verification for All Eigenpairs in Symmetric Positive Definite Generalized Eigenvalue Problems
نویسندگان
چکیده
A fast method for enclosing all eigenpairs in symmetric positive definite generalized eigenvalue problems is proposed. Firstly theorems on verifying all eigenvalues are presented. Next a theorem on verifying all eigenvectors is presented. The proposed method is developed based on these theorems. Numerical results are presented showing the efficiency of the proposed method. As an application of the proposed method, an efficient method of enclosing all eigenpairs in the quadratic eigenvalue problem is also sketched.
منابع مشابه
Partitioning Inverse Monte Carlo Iterative Algorithm for Finding the Three Smallest Eigenpairs of Generalized Eigenvalue Problem
It is well known that the problem of calculating the largest or smallest generalized eigenvalue problem is one of the most important problems in science and engineering 1, 2 . This problem arises naturally in many applications. Mathematically, it is a generalization of the symmetric eigenvalue problem, and it can be reduced to an equivalent symmetric eigenvalue problem. Let A,B ∈ n×n be real sy...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملVariable-step preconditioned conjugate gradient method for partial symmetric eigenvalue problems
in which A is a large sparse symmetric positive definite matrix, λ is an eigenvalue and u is a corresponding eigenvector. The evaluation of one or more smallest eigenpairs has much practical interest for describing the characteristics of physical phenomena. For example, smallest eigenvalues characterize the base frequences of vibrating mechanical structures. Typically, the matrix A is a discret...
متن کاملPreconditioned Locally Harmonic Residual Method for Computing Interior Eigenpairs of Certain Classes of Hermitian Matrices
We propose a Preconditioned Locally Harmonic Residual (PLHR) method for computing several interior eigenpairs of a generalized Hermitian eigenvalue problem, without traditional spectral transformations, matrix factorizations, or inversions. PLHR is based on a short-term recurrence, easily extended to a block form, computing eigenpairs simultaneously. PLHR can take advantage of Hermitian positiv...
متن کاملAdaptive Model Trust Region Methods for Generalized Eigenvalue Problems
Computing a few eigenpairs of large-scale matrices is a significant problem in science and engineering applications and a very active area of research. In this paper, two methods that compute extreme eigenpairs of positive-definite matrix pencils are combined into a hybrid scheme that inherits the advantages of both constituents. The hybrid algorithm is developed and analyzed in the framework o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Reliable Computing
دوره 14 شماره
صفحات -
تاریخ انتشار 2010